On minimizing width in linear layouts
نویسندگان
چکیده
منابع مشابه
On Linear Layouts of Graphs
In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A k-stack (respectively, k-queue, k-arch) layout of a graph consists of a total order of the vertices, and a partition of the edges into k sets of pairwise non-crossing (respectively, non-nested, non-disjoint) edges. Motivated by numerous applications, stack layouts (also call...
متن کاملMinimizing Congestion of Layouts for ATMNetworks
We consider the problem of constructing virtual path layouts for an ATM network consisting of a complete network K n of n processors in which a certain number of links may fail. Our main goal is to construct layouts which tolerate any connguration of up to f layouts and have the least possible congestion. First, we study the minimal congestion of 1-hop f-tolerant layouts in K n. For any positiv...
متن کاملLinear Layouts in Submodular Systems
Linear layout of graphs/digraphs is one of the classical and important optimization problems that have many practical applications. Recently Tamaki proposed an O(mn)-time and O(n)space algorithm for testing whether the pathwidth (or vertex separation) of a given digraph with n vertices and m edges is at most k. In this paper, we show that linear layout of digraphs with an objective function suc...
متن کاملMinimizing Crossings in Constrained Two-Sided Circular Graph Layouts
Circular layouts are a popular graph drawing style, where vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is NP-hard. One way to allow for fewer crossings in practice are two-sided layouts that draw some edges as curves in the exterior of the circle. In fact, oneand two-sided circular layouts are equivalent to one-page and two-pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1989
ISSN: 0166-218X
DOI: 10.1016/0166-218x(89)90016-4